Finite partially ordered sets of cohomological dimension one
نویسندگان
چکیده
منابع مشابه
Tripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملMethods of Calculating Cohomological and Hochschild–mitchell Dimensions of Finite Partially Ordered Sets
Mitchell characterized all finite partially ordered sets with incidence ring of Hochschild dimension 0, 1, and 2. Cheng characterized all finite partially ordered sets of cohomological dimension one. There are no conjectures in other dimensions. This article contains the algorithms for calculating the dimensions of finite partially ordered sets by elementary operations over rows and columns of ...
متن کاملComputational aspects of the 2-dimension of partially ordered sets
A well-known method to represent a partially ordered set P (order for short) consists in associating to each element of P a subset of a 7xed set S = {1; : : : ; k} such that the order relation coincides with subset inclusion. Such an embedding of P into 2 (the lattice of all subsets of S) is called a bit-vector encoding of P. These encodings provide an interesting way to store an order. They ar...
متن کاملOn the fractional dimension of partially ordered sets
We use a variety of combinatorial techniques to prove several theorems concerning fractional dimension of partially ordered sets. In particular, we settle a conjecture of Brightwell and Scheinerman by showing that the fractional dimension of a poset is never more than the maximum degree plus one. Furthermore, when the maximum degree k is at least two, we show that equality holds if and only if ...
متن کاملInteractive Computation of Homology of Finite Partially Ordered Sets
We outline a method for practical use of an interactive system (APL) to compute the homology of finite partially ordered sets. 1. Prerequisites. All partially ordered sets (posets) are assumed finite. Given a poset , we say that b covers a if b > a and a g c ^ h implies a = c or b = c. Since we deal with finite posets, the order relation can be obtained as the reflexive, transitive clos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1976
ISSN: 0021-8693
DOI: 10.1016/0021-8693(76)90198-8